|
|
Intelligent Control of Traffic Lights
Skoták, Miloš ; Samek, Jan (referee) ; Malačka, Ondřej (advisor)
In this thesis is analyzed Multi-Agent system for intelligent control of traffic lights. For the simulation of a real situation was implemented a simulator of a traffic situation written in Java language, which is based on a cellular automata. In Multi-Agent system can be found not only communication between the agent and environment, but also communication among agents. To implement the rules was used extended AgentSpeak language model based on BSD with Jason interpreter. Experiments were done on a real road section in the city Brno.
|
|
|
Simulation of Physical Phenomena Using Cellular Automata
Martinek, Dominik ; Smrčka, Aleš (referee) ; Peringer, Petr (advisor)
This master's thesis deals with modelling and simulation of physical phenomena by cellular automata. The basic methods which model physical phenomena is enumerated and descibed in this thesis. One of the important part of this thesis is a set of demonstration models. Each model is focused on one selected area of physical phenomena. All models are described by transtition rules and the procedure of derivation of these rules is also presented here. There rules were used in implemented models. Another part of this thesis contains of a simulation application for these models. The real application had been implemented in accord with this design and it has been used to perform the simulation experiments with exemplary models. Results of the simulation experiments are discussed in conclusion of this thesis. One exemplary model had also been adapted for parallel processing. The performances on a computer with different count of working processors were measured and are also discussed in the conclusion of this thesis
|
|
|
Mobile robot path planning by means of cellular automata
Holoubek, Tomáš ; Šoustek, Petr (referee) ; Dvořák, Jiří (advisor)
This thesis deals with a path planning using cellular automata algorithms in a rectangular grid environment. Theoretical part starts with an overview of commonly used approaches for path planning and later on focuses on existing cellular automata solutions and capabilities in detail. Implemented cellular automata algorithms and the commonly used path planning algorithms are together with a map generator described in the practical part. Conclusion of this thesis contains results completed in a special application.
|
|
|
Self-Modifying Cellular Automata
Szabo, Peter ; Drábek, Vladimír (referee) ; Bidlo, Michal (advisor)
This work deals with cellular automata with a concept of self- modification and their comparsion against regular cellular automatons . For this task we constructed a simulator , that lets us define the logic of artificial inteligence, number generator and statistical test, which are used by the automata , on their own . Consequently two experiments are carried out that demonstrate the concept of self- modification .
|
|
|
Procedurally Generated City
Hájíček, Lukáš ; Polok, Lukáš (referee) ; Šolony, Marek (advisor)
This work is about procedural generation of cities. There are defined the different stages of city development and existing methods used to achieve them. The following describes the procedures used to implement a system capable of generating cities. The resulting generator is able to generate cities based on given parameters such as density of streets.
|
|
|
Diploma work
Němec, Jakub ; Magid, Václav (referee) ; Mikyta, Svätopluk (advisor)
The aim of my work is to reflect expression coincidence that reflects the theoretical basis of cellular automata and quantum mechanics. I think that art should point to examples of accurate knowledge and in this way spread among potential viewers. This is how I try to get closer to the subjective utopian society WERP-VEGA. I am not entirely convinced that fine arts can change the political situation or address fundamental civilization complications, but I believe that art is able to predict freely one of the possible scenarios of the future because one is only able to do what he can imagine.
|
|
|
Traffic Modelling Based on Cellular Automata
Hodaňová, Andrea ; Martinek, David (referee) ; Peringer, Petr (advisor)
Among many other fields of science, cellular automata play an important role also in the microsimulations of traffic. In this thesis, we analyze the characteristics of a wide range of cellular automata traffic models from the most simple deterministic ones to complex stochastic automata derived from the pivotal Nagel-Schreckenberg model, which is thoroughly described. As a result of this analysis, a generally usable traffic simulator is designed and implemented in the Java programming language. Its graphical user interface can visualise the state of a road CA to display the key features of the implemented traffic models to the user.
|
|
|
Acceleration of Microscopic Urban Traffic Simulation Using OpenCL
Urminský, Andrej ; Kajan, Michal (referee) ; Korček, Pavol (advisor)
As the number of vehicles on our roads increases, the problems related to this phenomenon emerge more dramatically. These problems include car accidents, congestions and CO2 emissions production, increasing CO2 concentrations in the atmosphere. In order to minimize these impacts and to use the road infrastructure eff ectively, the use of traffic simulators can come in handy. Thanks to these tools, it is possible to evaluate the evolution of a traffic flow with various initial states of the simulation and thus know what to do and how to react in different states of the real-world traffic situations. This thesis deals with acceleration of microscopic urban traffic simulation using OpenCL. Supposing it is necessary to simulate a large network traffic, the need to accelerate the simulation is necessary. For this purpose, it is possible, for example, to use the graphics processing units (GPUs) and the technique of GPGPU for general purpose computations, which is used in this work. The results show that the performance gains of GPUs are significant compared to a parallel implementation on CPU.
|
|
|
Prediction of Secondary Structure of Proteins Using Cellular Automata
Brigant, Vladimír ; Drahošová, Michaela (referee) ; Bendl, Jaroslav (advisor)
This work describes a method of the secondary structure prediction of proteins based on cellular automaton (CA) model - CASSP. Optimal model and CA transition rule parameters are acquired by evolutionary algorithm. Prediction model uses only statistical characteristics of amino acids, so its prediction is fast. Achieved results was compared with results of other tools for this purpose. Prediction cooperation with a existing tool PSIPRED was also tested. It didn't succeed to beat this existing tool, but partial improvement was achieved in prediction of only alpha-helix secondary structure motif, what can be helful if we need the best prediction of alpha-helices. It was developed also a web interface of designed system.
|
|
|
Pseudorandom Number Generation in FPGA
Korček, Pavol ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
This bachelor thesis analyzes various implementations of pseudorandom number generators. In particular, two most-widely used mechanisms in generating the pseudorandom numbers in digital systems based on linear feedback shift register (LFSR) and cellular automata (CA) are described. Two models which are also widely used in practice were chosen from each group and implemented in C language. Additionally, another interesting combinatorial scheme of LFSR which is also sometimes used was implemented. Evaluation of the generators using Diehard set of statistical test was performed as well. Another part of this work dealt with implementing the chosen generators in a hardware description language. The choice was made for VHDL and several models, including the serial and parallel type of LFSR, were described in this language. Finally, a serial type of LFSR was implemented on the educational platform FITKit. The demands for area consumption of implemented generators were also investigated.
|
guest ::
